A mean value formula for elliptic curves
نویسندگان
چکیده
It is proved in this paper that for any point on an elliptic curve, the mean value of x-coordinates of its n-division points is the same as its x-coordinate.
منابع مشابه
Mean value formulas for twisted Edwards curves
R. Feng, and H. Wu recently established a certain mean-value formula for the x-coordinates of the n-division points on an elliptic curve given in Weierstrass form (A mean value formula for elliptic curves, 2010, available at http://eprint.iacr.org/2009/586.pdf ). We prove a similar result for both the x and y-coordinates on a twisted Edwards elliptic curve.
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملGenus Formula for Modular Curves of D-elliptic Sheaves
We prove a genus formula for modular curves of D-elliptic sheaves. We use this formula to show that the reductions of modular curves of D-elliptic sheaves attain the Drinfeld-Vladut bound as the degree of the discriminant of D tends to infinity.
متن کاملHeuristics on pairing-friendly elliptic curves
We present a heuristic asymptotic formula as x → ∞ for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree k ≥ 3, with fixed discriminant, with rho-value bounded by a fixed ρ0 such that 1 < ρ0 < 2, and with prime subgroup order at most x.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009